Analysing Finitely Presented Groups by Constructing Representations

نویسندگان

  • Wilhelm Plesken
  • Bernd Souvignier
چکیده

One idea how to prove that a finitely presented group G is infinite is to construct suitable homomorphisms into infinite matrix groups. In [HoP 92] this is done by starting with a finite image H of G and solving linear equations to check whether the epimorphism onto H can be lifted to a representation whose image is an extension of a ZZ-lattice by H, thus exhibiting an infinite abelian section of G in case it exists near the top of the group. The variation of the idea presented here seems to be suitable for instance for some groups where the kernel of the epimorphism onto H has a pro-p-completion of bounded width. The price to be paid is that algebraic rather than linear equations have to be solved. These are obtained from evaluating the relations on matrices with indeterminates as entries. This system of equations can be simplified by applying some representation theory, but it often remains too complicated for direct methods e.g. Gröbner base calculations or elimination of variables by taking resultants. An alternative to the direct methods is to find a modular solution and to lift it to a solution over a p-adic field. Knowing a finite epimorphic image H of G, H and its modular representation theory might give us a hint which modular representation of H one should try to lift to a p-adic representation of G. A multi-dimensional version of Hensel’s lemma often assures that it is sufficient to lift a solution only a few steps to conclude that it can be lifted to a solution over a p-adic field. Note, although the initial equations are algebraic, each step of the lifting process is just a problem of solving linear equations over a finite field. In general it is not clear that the lifting process leads to entries which are algebraic over I Q even in the situation where each lift is equivalent to a representation whose entries are algebraic over I Q. To get a representation defined over a number field K (with degree [K : I Q] as small as possible), therefore involves two steps: To pass from the lifted representation to one with p-adic entries which are algebraic over I Q and to identify the new entries as algebraic numbers. In the examples of this paper the first step turned out to be superfluous, since the lifted representation had already entries with rational minimal polynomials of small degree, see however [HPS 94] for a more ill-behaved example. The second step is discussed in Section 5. Sometimes the lift does not work in characteristic 0, however is possible in the ring IFp[[x]] of Laurent series over IFp. An even simpler method than the one for number fields yields a representation over the field of rational functions over IFp. In both

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Constructing Matrix Representations of Finitely Presented Groups

The Todd-Coxeter coset enumeration algorithm is one of the most powerful tools of computational group theory. It may be viewed as a means of constructing permutation representations of nitely presented groups. In this paper we present an analogous algorithm for directly constructing matrix representations over many elds. In fact the algorithm is more general than this, and can be used to constr...

متن کامل

Constructing Irreducible Representations of Finitely Presented Algebras

We describe an algorithmic test, using the “standard polynomial identity” (and elementary computational commutative algebra), for determining whether or not a finitely presented associative algebra has an irreducible n-dimensional representation. When ndimensional irreducible representations do exist, our proposed procedure can (in principle) produce explicit constructions.

متن کامل

Finitely Presented Subgroups of Automatic Groups and Their Isoperimetric Functions

We describe a general technique for embedding certain amalgamated products into direct products. This technique provides us with a way of constructing a host of finitely presented subgroups of automatic groups which are not even asynchronously automatic. We can also arrange that such subgroups satisfy, at best, an exponential isoperimetric inequality.

متن کامل

Representing Subgroups of Finitely Presented Groups by Quotient Subgroups

CONTENTS This article proposes to represent subgroups of finitely presented 1 . Creation of Quotient Representations and Easy Calculations g r o u p s b y t h e i r i m a g e i n a quo t ient. It gives algorithms for basic 2. Subdirect Products operations in this representation and investigates how iteration 3. Iterated Quotient Representations of this approach can be used to extend known quoti...

متن کامل

A computer-assisted analysis of some matrix groups

We use algorithms developed recently for the study of linear groups to investigate a sequence of matrix groups defined over GF(2); these are images of representations of certain finitely presented groups considered by Soicher in a study of simplicial complexes related to the Suzuki sequence graphs.

متن کامل

Grothendieck’s Problems concerning Profinite Completions and Representations of Groups

In 1970 Alexander Grothendieck [6] posed the following problem: let Γ1 and Γ2 be finitely presented, residually finite groups, and let u : Γ1 → Γ2 be a homomorphism such that the induced map of profinite completions û : Γ̂1 → Γ̂2 is an isomorphism; does it follow that u is an isomorphism? In this paper we settle this problem by exhibiting pairs of groups u : P ↪→ Γ such that Γ is a direct product...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Symb. Comput.

دوره 24  شماره 

صفحات  -

تاریخ انتشار 1997